Self-stabilizing Uniform Reliable Broadcast

Message-Efficient Uniform Timed Reliable Broadcast

In distributed database systems, atomic commitment protocols ensure that transactions leave the database in a consistent state even if failures occur during transactions. As shown by Babaoglu and Toueg, the heart of the atomic commitment problem is equivalent to uniform timed reliable broadcast (UTRB), which is a broadcast primitive that provides the following guarantees [Babaoglu and Toueg]: B...

Reliable Self-Stabilizing Communication for Quasi Rendezvous

The paper presents three self-stabilizing protocols for basic fair and reliable link communication primitives. We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours’ registers. The first primitive guarantees that any process writes a new value in its register(s) only after all its neighbours have read the...

Fair and Reliable Self-stabilizing Communication

We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours’ registers. The paper presents two self-stabilizing protocols for basic fair and reliable link communication primitives. The first primitive guarantees that any process writes a new value in its register(s) only after all its neighbours have read the p...

Token-Based Self-Stabilizing Uniform Algorithms

Uniform Dynamic Self-Stabilizing Leader Election

A distributed system is self-stabilizing if it can be started in any possible global state. Once started the system regains its consistency by itself, without any kind of outside intervention. The self-stabilization property makes the system tolerant to faults in which processors exhibit a faulty behavior for a while and then recover spontaneously in an arbitrary state. When the intermediate pe...